On Visibility Problems with an Infinite Discrete Set of Obstacles
نویسندگان
چکیده
منابع مشابه
The Existence of an Infinite Discrete Set of Transmission Eigenvalues
We prove the existence of an infinite discrete set of transmission eigenvalues corresponding to the scattering problem for isotropic and anisotropic inhomogeneous media for both the Helmholtz and Maxwell’s equations. Our discussion includes the case of the interior transmission problem for an inhomogeneous medium with cavities, i.e. subregions with contrast zero.
متن کاملan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولA Level-set Approach for Inverse Problems Involving Obstacles
An approach for solving inverse problems involving obstacles is proposed. The approach uses a level-set method which has been shown to be eeective in treating problems of moving boundaries, particularly those that involve topological changes in the geometry. We develop two computational methods based on this idea. One method results in a nonlinear time-dependent partial diierential equation for...
متن کاملA Level Set Framework for Visibility Related Variational Problems
We introduce a framework and construct algorithms based on it to handle optimization problems that deal with the maximization of visibility information for observers when obstacles to vision are present in the environment. This framework uses at its core the approach developed in [14] which adopts the level set framework of [10] to construct a function that encodes visibility information in a c...
متن کاملVisibility in Discrete Geometry: An Application to Discrete Geodesic Paths
In this article, we present a discrete definition of the classical visibility in computational geometry. We present algorithms to compute the set of pixels in a non-convex domain that are visible from a source pixel. Based on these definitions, we define discrete geodesic paths in discrete domain with obstacles. This allows us to introduce a new geodesic metric in discrete geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2021
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-020-00265-1